Operation Refinement and Monotonicity in the Schema Calculus
نویسندگان
چکیده
The schema calculus of Z provides a means for expressing structured, modular specifications. Extending this modularity to program development requires the monotonicity of these operators with respect to refinement. This paper provides a thorough mathematical analysis of monotonicity with respect to four schema operations for three notions of operation refinement. The mathematical connection between the equational schema logic and monotonicity is discussed and evaluated.
منابع مشابه
Retrenchment: Extending the Reach of Refinement
Discussion of a simple example demonstrates various expressive limitations of the refinement calculus, and suggests a liberalization of refinement, called retrenchment, which will support an analogous formal development calculus. Useful concrete system behaviour can be specified outside the domain of pure refinement, and a case is made for fluidity between I/O and state components across the de...
متن کاملOn Equilibrium Problems ∗
Some iterative methods for solving equilibrium problems are suggested and analyzed by using the technique of the auxiliary principle. We have shown that the convergence of the proposed methods either requires only pseudomonotonicity, which is a weaker condition than monotonicity or partially relaxed strongly monotonicity. Our results represent an improvement and refinement of previously known r...
متن کاملComposing and Promoting Retrenchments in Z
We briefly review the the compositional mechanisms of Z, i.e. the schema calculus and promotion. Retrenchment, a generalization of classical data refinement, is reviewed in a Z setting. Experience applying retrenchment to the Mondex Electronic Purse specification [16, 8] – which used promotion in combination with refinement – has established that promotion is a useful tool in the requirements e...
متن کاملTwo-Step Methods for Variational Inequalities on Hadamard Manifolds
In this paper, we suggest and analyze a two-step method for solving the variational inequalities on Hadamard manifold using the auxiliary principle technique. The convergence of this new method requires only the partially relaxed strongly monotonicity, which is a weaker condition than monotonicity. Results can be viewed as refinement and improvement of previously known results.
متن کاملProximal Point Methods for Solving Mixed Variational Inequalities on the Hadamard Manifolds
We use the auxiliary principle technique to suggest and analyze a proximal point method for solving the mixed variational inequalities on the Hadamard manifold. It is shown that the convergence of this proximal point method needs only pseudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also considered. Results can be viewed as refinement and improvement of ...
متن کامل